1180B - Nick and Array - CodeForces Solution


greedy implementation *1500

Please click on ads to support us..

C++ Code:

#include<bits/stdc++.h>
using namespace std;
int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);   
    
    int n;
    cin>>n;
    vector<int> a(n);

    for(int i=0;i<n;i++)
        cin>>a[i];

    for(int i=0;i<n;i++)
        if(a[i]>=0)
            a[i]=-a[i]-1;
    

    int maxi=INT_MIN;
    int ind=-1;
    for(int i=0;i<n;i++)
    {
        if(abs(a[i])>maxi)
        {
            maxi=abs(a[i]);
            ind=i;
        }
    }

    if(n&1)
        a[ind]=-a[ind]-1;
        
    for(auto i:a)
    {
        cout<<i<<" ";
    }
    cout<<endl;

return 0;
}


Comments

Submit
0 Comments
More Questions

1395A - Boboniu Likes to Color Balls
1637C - Andrew and Stones
1334B - Middle Class
260C - Balls and Boxes
1554A - Cherry
11B - Jumping Jack
716A - Crazy Computer
644A - Parliament of Berland
1657C - Bracket Sequence Deletion
1657B - XY Sequence
1009A - Game Shopping
1657A - Integer Moves
230B - T-primes
630A - Again Twenty Five
1234D - Distinct Characters Queries
1183A - Nearest Interesting Number
1009E - Intercity Travelling
1637B - MEX and Array
224A - Parallelepiped
964A - Splits
1615A - Closing The Gap
4C - Registration System
1321A - Contest for Robots
1451A - Subtract or Divide
1B - Spreadsheet
1177A - Digits Sequence (Easy Edition)
1579A - Casimir's String Solitaire
287B - Pipeline
510A - Fox And Snake
1520B - Ordinary Numbers